Contributions to clique-width of graphs
نویسنده
چکیده
منابع مشابه
Clique-width of full bubble model graphs
A bubble model is a 2-dimensional representation of proper interval graphs. We consider proper interval graphs that have bubble models of specific properties. We characterise the maximal such proper interval graphs of bounded clique-width and of bounded linear cliquewidth and the minimal such proper interval graphs whose clique-width and linear cliquewidth exceed the bounds. As a consequence, w...
متن کاملPolynomial-time Algorithm for Isomorphism of Graphs with Clique-width at most 3
The clique-width is a measure of complexity of decomposing graphs into certain tree-like structures. The class of graphs with bounded clique-width contains bounded tree-width graphs. While there are many results on the graph isomorphism problem for bounded treewidth graphs, very little is known about isomorphism of bounded cliquewidth graphs. We give the first polynomial-time graph isomorphism ...
متن کاملMinimal forbidden induced subgraphs of graphs of bounded clique-width and bounded linear clique-width
In the study of full bubble model graphs of bounded clique-width and bounded linear clique-width, we determined complete sets of forbidden induced subgraphs, that are minimal in the class of full bubble model graphs. In this note, we show that (almost all of) these graphs are minimal in the class of all graphs. As a corollary, we can give sets of minimal forbidden induced subgraphs for graphs o...
متن کاملA comparison of two approaches for polynomial time algorithms computing basic graph parameters
In this paper we compare and illustrate the algorithmic use of graphs of bounded treewidth and graphs of bounded clique-width. For this purpose we give polynomial time algorithms for computing the four basic graph parameters independence number, clique number, chromatic number, and clique covering number on a given tree structure of graphs of bounded tree-width and graphs of bounded clique-widt...
متن کاملGraphs of small bounded linear clique-width
In this paper we give the first characterisation of graphs with linear clique-width at most 3, and we give a polynomial-time recognition algorithm for such graphs. In addition, we give a new characterisation of graphs with linear clique-width at most 2 and a new layout characterisation of linear clique-width in general. Among our results is also a decomposition scheme that preserves the linear ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004